package 长度最小的子数组;

class Solution {
    public int minSubArrayLen(int target, int[] nums) {
        int n = nums.length;
        int sum = 0;
        int len = Integer.MAX_VALUE;
        for(int left = 0,right =0;right < n;right++){
            sum += nums[right];
            while(sum >= target && left <= right){
                len = Math.min(len,right - left + 1);
                sum -= nums[left++];
            }
        }
        return len == Integer.MAX_VALUE ? 0 : len;
    }
}